Constrained Runs algorithm as a lifting operator for the Boltzmann equation
نویسندگان
چکیده
Lifting operators play an important role in starting a kinetic Boltzmann model from given macroscopic information. The macroscopic variables need to be mapped to the distribution functions, mesoscopic variables of the Boltzmann model. A well-known numerical method for the initialization of Boltzmann models is the Constrained Runs algorithm. This algorithm is used in literature for the initialization of lattice Boltzmann models, special discretizations of the Boltzmann equation. It is based on the attraction of the dynamics toward the slow manifold and uses lattice Boltzmann steps to converge to the desired dynamics on the slow manifold. We focus on applying the Constrained Runs algorithm to map density, average flow velocity, and temperature, the macroscopic variables, to distribution functions. Furthermore, we do not consider only lattice Boltzmann models. We want to perform the algorithm for different discretizations of the Boltzmann equation and consider a standard finite volume discretization.
منابع مشابه
Numerical Extraction of a Macroscopic PDE and a Lifting Operator from a Lattice Boltzmann Model
Lifting operators play an important role in starting a lattice Boltzmann model from a given initial density. The density, a macroscopic variable, needs to be mapped to the distribution functions, mesoscopic variables, of the lattice Boltzmann model. Several methods proposed as lifting operators have been tested and discussed in the literature. The most famous methods are an analytically found l...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملInitialization of a Lattice Boltzmann Model with Constrained Runs (Extended Version)
In this article, we perform a numerical stability and convergence analysis of the constrained runs initialization scheme for a lattice Boltzmann model. Gear and Kevrekidis developed this scheme in the context of coarse-grained equation-free computing. Given the macroscopic initial fields, we study the mapping of these variables to the higher-dimensional space of lattice Boltzmann variables. The...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملLifting in hybrid lattice Boltzmann and PDE models
Mathematical models based on kinetic equations are ubiquitous in the modeling of granular media, population dynamics of biological colonies, chemical reactions and many other scientific problems. These individual-based models are computationally very expensive because the evolution takes place in the phase space. Hybrid simulations can bring down this computational cost by replacing locally in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1410.4399 شماره
صفحات -
تاریخ انتشار 2014